TSTP Solution File: SET623^5 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : SET623^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n004.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 09:19:39 EDT 2024

% Result   : Theorem 0.15s 0.43s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10  % Problem    : SET623^5 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.11  % Command    : run_E %s %d THM
% 0.10/0.31  % Computer : n004.cluster.edu
% 0.10/0.31  % Model    : x86_64 x86_64
% 0.10/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31  % Memory   : 8042.1875MB
% 0.10/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31  % CPULimit   : 300
% 0.10/0.31  % WCLimit    : 300
% 0.10/0.31  % DateTime   : Fri May  3 10:04:18 EDT 2024
% 0.10/0.31  % CPUTime    : 
% 0.15/0.42  Running higher-order theorem proving
% 0.15/0.42  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.N94bHMtdu8/E---3.1_19920.p
% 0.15/0.43  # Version: 3.1.0-ho
% 0.15/0.43  # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting new_ho_11 with 1500s (5) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # Starting new_ho_9 with 300s (1) cores
% 0.15/0.43  # Starting ho_unfolding_4 with 300s (1) cores
% 0.15/0.43  # sh5l with pid 19999 completed with status 0
% 0.15/0.43  # Result found by sh5l
% 0.15/0.43  # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting new_ho_11 with 1500s (5) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43  # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.15/0.43  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.43  # new_ho_10 with pid 20002 completed with status 0
% 0.15/0.43  # Result found by new_ho_10
% 0.15/0.43  # Preprocessing class: HSMSSMSSSSSNSSN.
% 0.15/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43  # Starting new_ho_11 with 1500s (5) cores
% 0.15/0.43  # Starting sh5l with 300s (1) cores
% 0.15/0.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43  # Search class: HUUPF-FFSF00-DSSFFFNN
% 0.15/0.43  # partial match(1): HUUPF-FFSF00-SSSFFFNN
% 0.15/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43  # Starting new_ho_10 with 181s (1) cores
% 0.15/0.43  # Preprocessing time       : 0.001 s
% 0.15/0.43  # Presaturation interreduction done
% 0.15/0.43  
% 0.15/0.43  # Proof found!
% 0.15/0.43  # SZS status Theorem
% 0.15/0.43  # SZS output start CNFRefutation
% 0.15/0.43  thf(decl_sort1, type, a: $tType).
% 0.15/0.43  thf(decl_22, type, epred1_0: a > $o).
% 0.15/0.43  thf(decl_23, type, epred2_0: a > $o).
% 0.15/0.43  thf(decl_24, type, epred3_0: a > $o).
% 0.15/0.43  thf(decl_25, type, esk1_0: a).
% 0.15/0.43  thf(cBOOL_PROP_99_pme, conjecture, ![X1:a > $o, X2:a > $o, X3:a > $o]:(((^[X4:a]:((((X1 @ X4)&~((((X2 @ X4)&~((X3 @ X4)))|((X3 @ X4)&~((X2 @ X4))))))|((((X2 @ X4)&~((X3 @ X4)))|((X3 @ X4)&~((X2 @ X4))))&~((X1 @ X4))))))=(^[X4:a]:((((((X1 @ X4)&~((X2 @ X4)))|((X2 @ X4)&~((X1 @ X4))))&~((X3 @ X4)))|((X3 @ X4)&~((((X1 @ X4)&~((X2 @ X4)))|((X2 @ X4)&~((X1 @ X4))))))))))), file('/export/starexec/sandbox2/tmp/tmp.N94bHMtdu8/E---3.1_19920.p', cBOOL_PROP_99_pme)).
% 0.15/0.43  thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o, X3:a > $o]:(((^[Z0/* 9 */:a]:(((X1 @ Z0&~(((X2 @ Z0&~(X3 @ Z0))|(X3 @ Z0&~(X2 @ Z0)))))|(((X2 @ Z0&~(X3 @ Z0))|(X3 @ Z0&~(X2 @ Z0)))&~(X1 @ Z0)))))=(^[Z0/* 9 */:a]:(((((X1 @ Z0&~(X2 @ Z0))|(X2 @ Z0&~(X1 @ Z0)))&~(X3 @ Z0))|(X3 @ Z0&~(((X1 @ Z0&~(X2 @ Z0))|(X2 @ Z0&~(X1 @ Z0))))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cBOOL_PROP_99_pme])])).
% 0.15/0.43  thf(c_0_2, negated_conjecture, ((^[Z0/* 9 */:a]:(((epred1_0 @ Z0&~(((epred2_0 @ Z0&~(epred3_0 @ Z0))|(epred3_0 @ Z0&~(epred2_0 @ Z0)))))|(((epred2_0 @ Z0&~(epred3_0 @ Z0))|(epred3_0 @ Z0&~(epred2_0 @ Z0)))&~(epred1_0 @ Z0)))))!=(^[Z0/* 9 */:a]:(((((epred1_0 @ Z0&~(epred2_0 @ Z0))|(epred2_0 @ Z0&~(epred1_0 @ Z0)))&~(epred3_0 @ Z0))|(epred3_0 @ Z0&~(((epred1_0 @ Z0&~(epred2_0 @ Z0))|(epred2_0 @ Z0&~(epred1_0 @ Z0))))))))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
% 0.15/0.43  thf(c_0_3, negated_conjecture, ((^[Z0/* 9 */:a]:((((epred1_0 @ Z0)&~((((epred2_0 @ Z0)&~((epred3_0 @ Z0)))|((epred3_0 @ Z0)&~((epred2_0 @ Z0))))))|((((epred2_0 @ Z0)&~((epred3_0 @ Z0)))|((epred3_0 @ Z0)&~((epred2_0 @ Z0))))&~((epred1_0 @ Z0))))))!=(^[Z0/* 9 */:a]:((((((epred1_0 @ Z0)&~((epred2_0 @ Z0)))|((epred2_0 @ Z0)&~((epred1_0 @ Z0))))&~((epred3_0 @ Z0)))|((epred3_0 @ Z0)&~((((epred1_0 @ Z0)&~((epred2_0 @ Z0)))|((epred2_0 @ Z0)&~((epred1_0 @ Z0)))))))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.15/0.43  thf(c_0_4, negated_conjecture, ((((((epred1_0 @ esk1_0)&~((epred2_0 @ esk1_0)))|((epred2_0 @ esk1_0)&~((epred1_0 @ esk1_0))))&~((epred3_0 @ esk1_0)))|((epred3_0 @ esk1_0)&~((((epred1_0 @ esk1_0)&~((epred2_0 @ esk1_0)))|((epred2_0 @ esk1_0)&~((epred1_0 @ esk1_0)))))))<~>(((epred1_0 @ esk1_0)&~((((epred2_0 @ esk1_0)&~((epred3_0 @ esk1_0)))|((epred3_0 @ esk1_0)&~((epred2_0 @ esk1_0))))))|((((epred2_0 @ esk1_0)&~((epred3_0 @ esk1_0)))|((epred3_0 @ esk1_0)&~((epred2_0 @ esk1_0))))&~((epred1_0 @ esk1_0))))), inference(neg_ext,[status(thm)],[c_0_3])).
% 0.15/0.43  thf(c_0_5, negated_conjecture, (~((epred2_0 @ esk1_0))|~((epred3_0 @ esk1_0))|~((epred1_0 @ esk1_0))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])])).
% 0.15/0.43  thf(c_0_6, negated_conjecture, (~((epred1_0 @ esk1_0))|~((epred3_0 @ esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_5])).
% 0.15/0.43  thf(c_0_7, negated_conjecture, (~((epred1_0 @ esk1_0))|~((epred2_0 @ esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_6])).
% 0.15/0.43  thf(c_0_8, negated_conjecture, ~((epred1_0 @ esk1_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_7]), c_0_6])).
% 0.15/0.43  thf(c_0_9, negated_conjecture, ((epred2_0 @ esk1_0)|(epred3_0 @ esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_8])).
% 0.15/0.43  thf(c_0_10, negated_conjecture, (~((epred2_0 @ esk1_0))|~((epred3_0 @ esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_6])).
% 0.15/0.43  thf(c_0_11, negated_conjecture, (epred2_0 @ esk1_0), inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_8]), c_0_9])).
% 0.15/0.43  thf(c_0_12, negated_conjecture, ~((epred3_0 @ esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11])])).
% 0.15/0.43  thf(c_0_13, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_4])]), c_0_11])]), c_0_12]), c_0_8]), ['proof']).
% 0.15/0.43  # SZS output end CNFRefutation
% 0.15/0.43  # Parsed axioms                        : 2
% 0.15/0.43  # Removed by relevancy pruning/SinE    : 1
% 0.15/0.43  # Initial clauses                      : 1
% 0.15/0.43  # Removed in clause preprocessing      : 0
% 0.15/0.43  # Initial clauses in saturation        : 1
% 0.15/0.43  # Processed clauses                    : 12
% 0.15/0.43  # ...of these trivial                  : 0
% 0.15/0.43  # ...subsumed                          : 0
% 0.15/0.43  # ...remaining for further processing  : 11
% 0.15/0.43  # Other redundant clauses eliminated   : 0
% 0.15/0.43  # Clauses deleted for lack of memory   : 0
% 0.15/0.43  # Backward-subsumed                    : 3
% 0.15/0.43  # Backward-rewritten                   : 2
% 0.15/0.43  # Generated clauses                    : 263
% 0.15/0.43  # ...of the previous two non-redundant : 10
% 0.15/0.43  # ...aggressively subsumed             : 0
% 0.15/0.43  # Contextual simplify-reflections      : 6
% 0.15/0.43  # Paramodulations                      : 1
% 0.15/0.43  # Factorizations                       : 0
% 0.15/0.43  # NegExts                              : 1
% 0.15/0.43  # Equation resolutions                 : 0
% 0.15/0.43  # Disequality decompositions           : 0
% 0.15/0.43  # Total rewrite steps                  : 3
% 0.15/0.43  # ...of those cached                   : 2
% 0.15/0.43  # Propositional unsat checks           : 0
% 0.15/0.43  #    Propositional check models        : 0
% 0.15/0.43  #    Propositional check unsatisfiable : 0
% 0.15/0.43  #    Propositional clauses             : 0
% 0.15/0.43  #    Propositional clauses after purity: 0
% 0.15/0.43  #    Propositional unsat core size     : 0
% 0.15/0.43  #    Propositional preprocessing time  : 0.000
% 0.15/0.43  #    Propositional encoding time       : 0.000
% 0.15/0.43  #    Propositional solver time         : 0.000
% 0.15/0.43  #    Success case prop preproc time    : 0.000
% 0.15/0.43  #    Success case prop encoding time   : 0.000
% 0.15/0.43  #    Success case prop solver time     : 0.000
% 0.15/0.43  # Current number of processed clauses  : 4
% 0.15/0.43  #    Positive orientable unit clauses  : 1
% 0.15/0.43  #    Positive unorientable unit clauses: 0
% 0.15/0.43  #    Negative unit clauses             : 3
% 0.15/0.43  #    Non-unit-clauses                  : 0
% 0.15/0.43  # Current number of unprocessed clauses: 0
% 0.15/0.43  # ...number of literals in the above   : 0
% 0.15/0.43  # Current number of archived formulas  : 0
% 0.15/0.43  # Current number of archived clauses   : 7
% 0.15/0.43  # Clause-clause subsumption calls (NU) : 7
% 0.15/0.43  # Rec. Clause-clause subsumption calls : 7
% 0.15/0.43  # Non-unit clause-clause subsumptions  : 7
% 0.15/0.43  # Unit Clause-clause subsumption calls : 4
% 0.15/0.43  # Rewrite failures with RHS unbound    : 0
% 0.15/0.43  # BW rewrite match attempts            : 1
% 0.15/0.43  # BW rewrite match successes           : 1
% 0.15/0.43  # Condensation attempts                : 12
% 0.15/0.43  # Condensation successes               : 0
% 0.15/0.43  # Termbank termtop insertions          : 8046
% 0.15/0.43  # Search garbage collected termcells   : 97
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.006 s
% 0.15/0.43  # System time              : 0.001 s
% 0.15/0.43  # Total time               : 0.007 s
% 0.15/0.43  # Maximum resident set size: 1792 pages
% 0.15/0.43  
% 0.15/0.43  # -------------------------------------------------
% 0.15/0.43  # User time                : 0.007 s
% 0.15/0.43  # System time              : 0.002 s
% 0.15/0.43  # Total time               : 0.009 s
% 0.15/0.43  # Maximum resident set size: 1720 pages
% 0.15/0.43  % E---3.1 exiting
% 0.15/0.43  % E exiting
%------------------------------------------------------------------------------